Word Problems and Confluence Problems for Restricted Semi-Thue Systems
نویسنده
چکیده
منابع مشابه
Complexity Results for Confluence Problems
We study the complexity of the confluence problem for restricted kinds of semi–Thue systems, vector replacement systems and general trace rewriting systems. We prove that confluence for length– reducing semi–Thue systems is P–complete and that this complexity reduces to NC in the monadic case. For length–reducing vector replacement systems we prove that the confluence problem is PSPACE– complet...
متن کاملAlgorithms and Reductions for Rewriting Problems
In this paper we initiate a study of polynomial-time reductions for some basic decision problems of rewrite systems. We then give a polynomial-time algorithm for the unique-normal-form property of ground systems for the first time. Next we prove undecidability of several problems for a fixed string rewriting system using our reductions. Finally, we prove the decidability of confluence for commu...
متن کاملA Polynomial Algorithm Testing Partial Confluence of Basic Semi-Thue Systems
We give a polynomial algorithm solving the problem “is S partially confluent on the rational set R?” for finite, basic, noetherian semi-Thue systems. The algorithm is obtained by a polynomial reduction of this problem to the equivalence problem for deterministic 2-tape finite automata, which has been shown to be polynomially decidable in Friedman and Greibach (1982).
متن کاملFp 1 Is Undecidable for Nitely Presented Monoids with Word Problems Decidable in Polynomial Time
In the rst part of this paper properties P of nitely presented monoids are considered that satisfy the following two conditions: (1) each monoid that can be presented through a nite convergent string-rewriting system has property P , and (2) each nitely presented monoid having property P is of homology type FP3. Following an idea presented in (Otto and Sattler-Klein 1997) it is shown that these...
متن کاملOn String Rewriting Systems
String rewriting systems, also known as semi-Thue systems, consist of a set of rules l → r, specifying valid replacements of substrings of strings over a given alphabet. In the case of one single rule, it is an open problem whether there is a system that is neither terminating nor looping. Another open question is the decidability of termination. Difficulties arise especially for non-confluent ...
متن کامل